Benders decomposition for very large scale partial set covering and maximal covering location problems
نویسندگان
چکیده
منابع مشابه
Fast heuristics for large scale covering-location problems
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening. 2002 Elsevier Science Ltd. All rights reserved.
متن کاملA Lagrangian-based heuristic for large-scale set covering problems
We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state of the art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables ...
متن کاملA Decomposition Heuristic for the Maximal Covering Location Problem
This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, ...
متن کاملAnalysis of Errors Due to Demand Data Aggregation in the Set Covering and Maximal Covering Location Problems
In this paper, we extend the concepts of demand data aggregation error to location problems involving coverage. These errors, which arise flora losses in locational information, may lead to suboptimal location patterns. They are potentially more significant in covering problems than in p-median problernsIbecause the distance metric is binary in covering problems. We examine the Hillsirtan and R...
متن کاملSet Covering Problems
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.12.021